منابع مشابه
The Graph of Triangulations of a Point Configuration with d +4 Vertices Is 3-Connected
We study the graph of bistellar ips between triangulations of a vector connguration A with d + 4 elements in rank d + 1 (i.e. with corank 3), as a step in the Baues problem. We prove that the graph is connected in general and 3-connected for acyclic vector conngurations, which include all point conngurations of dimension d with d + 4 elements. Hence, every pair of triangulations can be joined b...
متن کاملTetravalent edge-transitive Cayley graphs with odd number of vertices
A characterisation is given of edge-transitive Cayley graphs of valency 4 on odd number of vertices. The characterisation is then applied to solve several problems in the area of edge-transitive graphs: answering a question proposed by Xu (1998) regarding normal Cayley graphs; providing a method for constructing edge-transitive graphs of valency 4 with arbitrarily large vertex-stabiliser; const...
متن کاملMatching Extension Missing Vertices and Edges in Triangulations of Surfaces
Let G be a 5-connected triangulation of a surface Σ different from the sphere, and let χ = χ(Σ) be the Euler characteristic of Σ. Suppose that V0 ⊆ V (G) with |V (G) − V0| even and M and N are two matchings in G − V0 of sizes m and n respectively such that M ∩ N = ∅. It is shown that if the pairwise distance between any two elements of V0 ∪ M ∪ N is at least 5 and the face-width of the embeddin...
متن کاملOrthogonal Polynomial Method and Odd Vertices in Matrix Models
The method of orthogonal polynomials is a powerful technique for the non perturbative integration of matrix models over one [1] or more matrices [2] in particular with even potential, i.e. with vertices with an even number of legs. Indeed, with even potential, the calculation simplifies both because the integrals are well defined and, as we shall see, the number of equations needed to solve the...
متن کاملDouble Dudeney sets for an odd number of vertices
A double Dudeney set in Kn is a multiset of Hamilton cycles in Kn having the property that each 2-path in Kn lies in exactly two of the cycles. In this paper, we construct a double Dudeney set in Kn when n = p1p2 · · · ps + 2, where p1, p2, . . . , ps are different odd prime numbers and s is a natural number.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1985
ISSN: 0012-365X
DOI: 10.1016/0012-365x(85)90059-7